github.com/klauspost/compress/flate.tableEntryPrev.Prev (field)

74 uses

	github.com/klauspost/compress/flate (current package)
		fast_encoder.go#L104: 	Prev tableEntry
		level3.go#L43: 			if v.Prev.offset <= minOff {
		level3.go#L44: 				v.Prev.offset = 0
		level3.go#L46: 				v.Prev.offset = v.Prev.offset - e.cur + maxMatchOffset
		level3.go#L90: 			e.table[nextHash] = tableEntryPrev{Prev: candidates.Cur, Cur: tableEntry{offset: s + e.cur}}
		level3.go#L101: 				if candidates.Prev.offset < minOffset || uint32(cv) != load3232(src, candidates.Prev.offset-e.cur) {
		level3.go#L106: 				o2 := s - (candidates.Prev.offset - e.cur)
		level3.go#L109: 					candidate = candidates.Prev
		level3.go#L115: 				candidate = candidates.Prev
		level3.go#L172: 						Prev: e.table[nextHash].Cur,
		level3.go#L183: 					Prev: e.table[nextHash].Cur,
		level3.go#L192: 				Prev: e.table[prevHash].Cur,
		level3.go#L199: 				Prev: e.table[prevHash].Cur,
		level3.go#L207: 				Prev: candidates.Cur,
		level3.go#L220: 				candidate = candidates.Prev
		level5.go#L48: 				v.Prev.offset = 0
		level5.go#L51: 				if v.Prev.offset <= minOff {
		level5.go#L52: 					v.Prev.offset = 0
		level5.go#L54: 					v.Prev.offset = v.Prev.offset - e.cur + maxMatchOffset
		level5.go#L107: 			eLong.Cur, eLong.Prev = entry, eLong.Cur
		level5.go#L118: 					eLong.Cur, eLong.Prev = tableEntry{offset: nextS + e.cur}, eLong.Cur
		level5.go#L120: 					t2 := lCandidate.Prev.offset - e.cur
		level5.go#L121: 					if s-t2 < maxMatchOffset && uint32(cv) == load3232(src, lCandidate.Prev.offset-e.cur) {
		level5.go#L132: 				t = lCandidate.Prev.offset - e.cur
		level5.go#L133: 				if s-t < maxMatchOffset && uint32(cv) == load3232(src, lCandidate.Prev.offset-e.cur) {
		level5.go#L137: 					eLong.Cur, eLong.Prev = tableEntry{offset: nextS + e.cur}, eLong.Cur
		level5.go#L151: 				eLong.Cur, eLong.Prev = tableEntry{offset: nextS + e.cur}, eLong.Cur
		level5.go#L166: 					t2 = lCandidate.Prev.offset - e.cur
		level5.go#L167: 					if nextS-t2 < maxMatchOffset && load3232(src, lCandidate.Prev.offset-e.cur) == uint32(next) {
		level5.go#L263: 				eLong.Cur, eLong.Prev = t, eLong.Cur
		level5.go#L269: 				eLong.Cur, eLong.Prev = t, eLong.Cur
		level5.go#L283: 					eLong.Cur, eLong.Prev = t, eLong.Cur
		level5.go#L297: 		eLong.Cur, eLong.Prev = tableEntry{offset: o}, eLong.Cur
		level5.go#L360: 				v.Prev.offset = 0
		level5.go#L363: 				if v.Prev.offset <= minOff {
		level5.go#L364: 					v.Prev.offset = 0
		level5.go#L366: 					v.Prev.offset = v.Prev.offset - e.cur + maxMatchOffset
		level5.go#L419: 			eLong.Cur, eLong.Prev = entry, eLong.Cur
		level5.go#L430: 					eLong.Cur, eLong.Prev = tableEntry{offset: nextS + e.cur}, eLong.Cur
		level5.go#L432: 					t2 := lCandidate.Prev.offset - e.cur
		level5.go#L433: 					if s-t2 < maxMatchOffset && uint32(cv) == load3232(src, lCandidate.Prev.offset-e.cur) {
		level5.go#L444: 				t = lCandidate.Prev.offset - e.cur
		level5.go#L445: 				if s-t < maxMatchOffset && uint32(cv) == load3232(src, lCandidate.Prev.offset-e.cur) {
		level5.go#L449: 					eLong.Cur, eLong.Prev = tableEntry{offset: nextS + e.cur}, eLong.Cur
		level5.go#L463: 				eLong.Cur, eLong.Prev = tableEntry{offset: nextS + e.cur}, eLong.Cur
		level5.go#L478: 					t2 = lCandidate.Prev.offset - e.cur
		level5.go#L479: 					if nextS-t2 < maxMatchOffset && load3232(src, lCandidate.Prev.offset-e.cur) == uint32(next) {
		level5.go#L575: 				eLong.Cur, eLong.Prev = t, eLong.Cur
		level5.go#L581: 				eLong.Cur, eLong.Prev = t, eLong.Cur
		level5.go#L595: 					eLong.Cur, eLong.Prev = t, eLong.Cur
		level5.go#L609: 		eLong.Cur, eLong.Prev = tableEntry{offset: o}, eLong.Cur
		level6.go#L48: 				v.Prev.offset = 0
		level6.go#L51: 				if v.Prev.offset <= minOff {
		level6.go#L52: 					v.Prev.offset = 0
		level6.go#L54: 					v.Prev.offset = v.Prev.offset - e.cur + maxMatchOffset
		level6.go#L108: 			eLong.Cur, eLong.Prev = entry, eLong.Cur
		level6.go#L122: 					eLong.Cur, eLong.Prev = tableEntry{offset: nextS + e.cur}, eLong.Cur
		level6.go#L125: 					t2 := lCandidate.Prev.offset - e.cur
		level6.go#L126: 					if s-t2 < maxMatchOffset && uint32(cv) == load3232(src, lCandidate.Prev.offset-e.cur) {
		level6.go#L138: 				t = lCandidate.Prev.offset - e.cur
		level6.go#L139: 				if s-t < maxMatchOffset && uint32(cv) == load3232(src, lCandidate.Prev.offset-e.cur) {
		level6.go#L143: 					eLong.Cur, eLong.Prev = tableEntry{offset: nextS + e.cur}, eLong.Cur
		level6.go#L159: 				eLong.Cur, eLong.Prev = tableEntry{offset: nextS + e.cur}, eLong.Cur
		level6.go#L188: 					t2 = lCandidate.Prev.offset - e.cur
		level6.go#L189: 					if nextS-t2 < maxMatchOffset && load3232(src, lCandidate.Prev.offset-e.cur) == uint32(next) {
		level6.go#L237: 				t2 = eLong.Prev.offset - e.cur - l + skipBeginning
		level6.go#L292: 				eLong.Cur, eLong.Prev = tableEntry{offset: i + e.cur}, eLong.Cur
		level6.go#L306: 				eLong.Cur, eLong.Prev = t, eLong.Cur
		level6.go#L307: 				eLong2.Cur, eLong2.Prev = t2, eLong2.Cur